package com.wc.算法基础课.E第五讲动态规划.计数类DP.整数划分;

import java.util.Scanner;

/**
 * @Author congge
 * @Date 2024/1/17 10:44
 * @description 完全背包思想, f[i] 表示 当数字为i时候的数量
 * https://www.acwing.com/problem/content/902/
 */
public class Main {
    static int N = 1010;
    static long[] f = new long[N];
    static int mod = (int) 1e9 + 7;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        f[0] = 1;
        for (int i = 1; i <= n; i++) {
            for (int j = i; j <= n; j++) {
                f[j] = (f[j] + f[j - i]) % mod;
            }
        }
        System.out.println(f[n]);
    }
}

